Codes with forbidden distances
نویسندگان
چکیده
منابع مشابه
Map Decoding of Arithmetic Codes with a Forbidden Symbol
In this paper, a novel maximum a posteriori (MAP) technique for the decoding of arithmetic codes in the presence of transmission errors is presented. Arithmetic codes with a forbidden symbol and trellis search techniques are employed in order to estimate the best transmitted codeword. The viability of the proposed approach is demonstrated in the binary symmetric channel case in terms of both pe...
متن کاملDistances forbidden bY two - colorings of Q 3 and A ,
Chow, T., Distances forbidden by two-colorings of Q3 and A,, Discrete Mathematics 115 (1993) 95-102. For X = Q3 or A, (where A, is the set of points in Q” whose coordinates have odd denominators), we characterize all sets of distances D c R + with the following property: there exists some two-coloring of X such that, for all d ED, no two points in X that arc a distance d apart are the same colo...
متن کاملSome new binary codes with improved minimum distances
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In this paper, a method to conduct a computer search for binary 2-generator QC codes is presented, and a large number of good 2-generator QC codes have been obtained. 5 new binary QC codes that improve the lower bounds on minimum distance are presented. Furthermore, with new 2-generator QC codes and Constr...
متن کاملPairs of codes with prescribed Hamming distances and coincidences
The main problem of coding theory is to construct codes with large Hamming-distances between the code-words. In this work we describe a fast algorithm for generating pairs of q-ary codes with prescribed pairwise Hamming-distances and coincidences (for a letter s 2 f0; 1; : : : ; q 1g, the number of s-coincidences between codewords a and b is the number of letters s in the same positions both in...
متن کاملOn maximal antipodal spherical codes with few distances
Using linear programming techniques we derive bounds for antipodal spherical codes. The possibilities for attaining our bounds are investigated and Lloyd-type theorems are proved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00161-2